A multi-parameter analysis of hard problems on deterministic finite automata
نویسندگان
چکیده
منابع مشابه
A multi-parameter analysis of hard problems on deterministic finite automata
We initiate a multi-parameter analysis of two well-known NP-hard problems on deterministic finite automata (DFAs): the problem of finding a short synchronizing word, and that of finding a DFA on few states consistent with a given sample of the intended language and its complement. For both problems, we study natural parameterizations and classify them with the tools provided by Parameterized Co...
متن کاملExtending word problems in deterministic finite automata
A word w is extending a subset of states S of a deterministic finite automaton, if the set of states mapped to S by w (the preimage of S under the action of w) is larger than S. This notion together with its variations has particular importance in the field of synchronizing automata, where a number of methods and algorithms rely on finding (short) extending words. In this paper we study the com...
متن کاملCycle Analysis for Deterministic Finite State Automata
A method for the determination of all cycles of deterministic finite state automata is presented. Using a finite field description GF(2) these automata are shown to correspond to multilinear state equations. Basic results from feedback shift register theory are recalled and developed towards a complete analysis tool for affine-linear automata. The multilinear case is reduced to the affine-linea...
متن کاملFailure Deterministic Finite Automata
Inspired by failure functions found in classical pattern matching algorithms, a failure deterministic finite automaton (FDFA) is defined as a formalism to recognise a regular language. An algorithm, based on formal concept analysis, is proposed for deriving from a given deterministic finite automaton (DFA) a language-equivalent FDFA. The FDFA’s transition diagram has fewer arcs than that of the...
متن کاملRemarks on Multiple Entry Deterministic Finite Automata
We investigate several aspects of the multiple entry DFA’s. We consider their DFA conversion. Further, we show that they appear as minimal NFA’s for certain classes of languages. Finally, we deal with their decompositions into disjoint unions of automata with fewer states.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2015
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2014.12.027